A CPS-Transform of Constructive Classical Logic
نویسنده
چکیده
We show that the cut-elimination for LKT, as presented in Danos et al.(1993), simulates the normalization for classical natural deduction(CND). Particularly, the denotation for CND inherits the one for LKT. Moreover the transform from CND proof (i.e., Parigot's -term) to LKT proof can be considered as a classical extension to call-by-name (CBN) CPS-transform.
منابع مشابه
Constructive Classical Logic as CPS-Calculus
We establish the Curry-Howard isomorphism between constructive classical logic and CPS-calculus. CPS-calculus exactly means the target language of Continuation Passing Style(CPS) transforms. Constructive classical logic we refer to are LKT and LKQ introduced by Danos et al.(1993).
متن کاملCorrespondence between Normalization of CND and Cut-Elimination of LKT
We study the correspondence between normalization of two well-known constructive classical logic, namely CND (Parigot 92) and LKT (Danos-Joinet-Schellinx 93). For this, we develop term calculi. We then show translation from CND to LKT and show the simulation theorem; the normalization of CND can be simulated by cut-elimination of LKT. Furthermore, we argue that the translation can be considered...
متن کاملCall-By-Value λμ-calculus and Its Simulation by the Cut-Elimination Procedure for LKQ
We show Call-By-Value(CBV) normalization forCND (Parigot 92) can be simulated by by cut-elimination for LKQ (Danos-JoinetSchellinx 93), namely q-protocol. For this, a new term calculus was made for each classical logic. A term calculus for CND is a CBV version of Parigot’s λμ-calculus. A completely new term calculus for LKQ is presented in a style of classical extension of λ-calculus with a let...
متن کاملFrom shift and reset to polarized linear logic
Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic logic, a λ-calculus with firstclass continuations corresponds to classical logic. We study how first-class delimited continuations [13], in the form of Danvy and Filinski’s shift and reset operators [10, 11], can also be logically interpreted. First, we refine Danvy and Filinski’s type system for shift and ...
متن کاملConfiguration as Model Construction: the Constructive Problem Solving Approach
Configuration is distinguished by two important aspects: the inherent well-structuredness of the problem description, and the synthetic type of problem solving. Up to now there is quite a number of (more or less) ad hoc approaches to configuration – but we are still missing a comprehensive formal treatment. In order to be adequate a formalization of configuration has to take both aspects into a...
متن کامل